Learning the Explainable Semantic Relations via Unified Graph Topic-Disentangled Neural Networks
نویسندگان
چکیده
Graph Neural Networks (GNNs) such as Convolutional (GCNs) can effectively learn node representations via aggregating neighbors based on the relation graph. However, despite a few exceptions, most of previous work in this line does not consider topical semantics underlying edges, making less effective and learned between nodes hard to explain. For instance, current GNNs make us usually don’t know what is reason for connection network nodes, specific research topics cited article concerns among friends social platforms. Some methods have begun explore extraction recent related literature, but existing studies generally face two bottlenecks, i.e., either being unable explain mined latent relations ensure their reasonableness independence, or demanding textual content edges which unavailable real-world datasets. Actually, these issues are both crucial practical use. In our work, we propose novel Topic-Disentangled Network (TDG) address above at same time, explores from perspective contents. We design an optimized graph topic module handle features construct independent explainable semantic subspaces, then reasonable that correspond subspaces assigned each neighborhood routing mechanism. Our proposed model be easily combined with tasks form end-to-end model, avoid risk deviation representation space task space. To evaluate efficiency sufficient node-related conducted three public datasets experimental section. The results show obvious superiority TDG compared state-of-the-art models.
منابع مشابه
Graph Convolutional Neural Networks via Scattering
We generalize the scattering transform to graphs and consequently construct a convolutional neural network on graphs. We show that under certain conditions, any feature generated by such a network is approximately invariant to permutations and stable to graph manipulations. Numerical results demonstrate competitive performance on relevant datasets.
متن کاملFew-Shot Learning with Graph Neural Networks
We propose to study the problem of few-shot learning with the prism of inference on a partially observed graphical model, constructed from a collection of input images whose label can be either observed or not. By assimilating generic message-passing inference algorithms with their neural-network counterparts, we define a graph neural network architecture that generalizes several of the recentl...
متن کاملDeep Neural Networks for Learning Graph Representations
In this paper, we propose a novel model for learning graph representations, which generates a low-dimensional vector representation for each vertex by capturing the graph structural information. Different from other previous research efforts, we adopt a random surfing model to capture graph structural information directly, instead of using the samplingbased method for generating linear sequence...
متن کاملProbabilistic Topic Modelling with Semantic Graph
In this paper we propose a novel framework, topic model with semantic graph (TMSG), which couples topic model with the rich knowledge from DBpedia. To begin with, we extract the disambiguated entities from the document collection using a document entity linking system, i.e., DBpedia Spotlight, from which two types of entity graphs are created from DBpedia to capture local and global contextual ...
متن کاملVisual Interpretability forDeepLearning
This paper reviews recent studies in emerging directions of understanding neural-network representations and learning neural networks with interpretable/disentangled middle-layer representations. Although deep neural networks have exhibited superior performance in various tasks, the interpretability is always an Achilles' heel of deep neural networks. At present, deep neural networks obtain a h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery From Data
سال: 2023
ISSN: ['1556-472X', '1556-4681']
DOI: https://doi.org/10.1145/3589964